Beyond massive parallelism: numerical computation using associative tables

نویسندگان

  • Craig C. Douglas
  • Willard L. Miranker
چکیده

Novel computing devices are exploited for numerical computation. The solution of a numerical problem is sought, which has been solved many times before, but this time with a di erent set of input data. A table is a classical way to collect the old solutions in order to exploit them to nd the new one. This process is extended to more general problems than the usual function value approximation. To do this, a new concept of table is introduced. These tables are addressed associatively. Several problems are treated both theoretically and computationally. These problems include solving linear systems of equations, partial di erential equations, nonlinear systems of ordinary di erential equations, and Karmarkar's algorithm. Hardware requirements are discussed. AMS(MOS) subject classi cations. 65W05, 65F10, 65N10

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploiting Data Parallelism for Efficient Execution of Logic Programs on Associative Super Computers

We describe a model to exploit data parallelism present in associative computers for efficient execution of logic programs on associative supercomputers. We present an alternate scheme for logical structure representation which naturally interfaces lists and vectors on associative computers for efficient integration of symbolic and numerical computation on existing associative supercomputers. W...

متن کامل

Design of an Optical Content-Addressable Parallel Processor with Applications to Fast Searching and Information Retrieval

Associative processing based on content-addressable memories has been argued to be the natural solution for non-numerical information processing applications. Unfortunately, the implementation requirements of these architectures using conventional electronic technology have been very cost prohibitive, and therefore associative processors have not been realized. Optics has the capability over el...

متن کامل

Exploiting data parallelism for efficient execution of logic programs with large knowledge bases

A model is presented which is designed to exploit data parallelism present in associative computers for the e cient execution of logic programs. Data parallel model allows e cient handling of very large knowledge bases. A scheme for logical data structure representation incorporating direct interface between lists and vectors is described which allows the e cient integration of symbolic and num...

متن کامل

Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network

This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed into a knapsack of size L W and are only obtainable with guillotine-type (side to side) cuts. The parallel algorithm is described and analyzed for the associative model. The associative model (ASC) for parallel comput...

متن کامل

Field Computation and Nonpropositional Knowledge

Most current AI technology has been based on propositionally represented theoretical knowledge. We argue that if AI is to accomplish its goals, especially in the tasks of sensory interpretation and sensorimotor coordination, then it must solve the problem of representing embodied practical knowledge. Biological evidence shows that animals use this knowledge in a way very different from digital ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Parallel Computing

دوره 16  شماره 

صفحات  -

تاریخ انتشار 1990